Scheduling Broadcasts in a Network of Timelines
نویسندگان
چکیده
Broadcasts and timelines are the primary mechanism of information exchange in online social platforms today. Services like Facebook, Twitter and Instagram have enabled ordinary people to reach large audiences spanning cultures and countries, while their massive popularity has created increasingly competitive marketplaces of attention. Timing broadcasts to capture the attention of such geographically diverse audiences has sparked interest from many startups and social marketing gurus. However, formal study is lacking on both the timing and frequency problems. We study for the first time the broadcast scheduling problem of specifying the timing and frequency of publishing content to maximise the attention received. We validate and quantify three interacting behavioural phenomena to parametrise social platform users: information overload, bursty circadian rhythms and monotony aversion, which is defined here for the first time. We formalise a timeline information exchange process based on these phenomena, and formulate an objective function that quantifies the expected collective attention. We finally present experiments on real data from Twitter, where we discover a counter-intuitive scheduling strategy that outperforms popular heuristics while producing fewer posts.
منابع مشابه
How to model planning and scheduling problems using constraint networks on timelines
The CNT framework (Constraint Network on Timelines) has been designed to model discrete event dynamic systems and the properties one knows, one wants to verify, or one wants to enforce on them. In this article, after a reminder about the CNT framework, we show its modeling power and its ability to support various modeling styles, coming from the planning, scheduling, and constraint programming ...
متن کاملHow to Model Planning and Scheduling Problems using Timelines
The CNT framework (Constraint Network on Timelines (Verfaillie, Pralet, and Lemaître 2008)) has been designed to model discrete event dynamic systems and the properties one knows, one wants to verify, or one wants to enforce on them. In this paper, after a reminder about the CNT framework, we show its modeling power, first on two generic problems (the planning problem in the STRIPS framework an...
متن کاملUsing Constraint Networks on Timelines to Model and Solve Planning and Scheduling Problems
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms of combination between the two domains. In this paper, we present a new framework, called Constraint Network on Timelines (CNT), to model and solve planning and scheduling problems. Basically, CNTs are a kind of dynami...
متن کاملAnticoagulation Strategies for the Orthopaedic Surgeon: Reversal and Timelines
Article Highlights: 1) This article provides a full anticoagulant reference for the practicing orthopaedic surgeon which can be used in any clinical scenario, whether urgent or elective surgical intervention is required 2) A comprehensive list of anticoagulant reversal agents and drugs with short half-lives (for bridging) are described with the intention to provide the data needed t...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1610.06052 شماره
صفحات -
تاریخ انتشار 2016